%%% general part

@InProceedings{emulab,
  author = {White, B. and Lepreau, J. and Stoller, L. and others},
  title={{An Integrated Experimental Environment for Distributed Systems and Networks}},
  booktitle = {{Proc. of OSDI}},
  month  = dec,
  year   = 2002,
  pages  = "255--270"
}

@InProceedings{acsac,
  author = {T. Benzel},
  title={{The Science of Cyber Security Experimentation: The DETER Project}},
  booktitle = {{Proc. of 2011 Annual Computer Security Applications Conference (ACSAC)}},
  month  = dec,
  year   = 2012,
}

@inproceedings{drf,
 author = {Ghodsi, Ali and Zaharia, Matei and Hindman, Benjamin and Konwinski, Andy and Shenker, Scott and Stoica, Ion},
 title = {Dominant Resource Fairness: Fair Allocation of Multiple Resource Types},
 booktitle = {Proceedings of the 8th USENIX Conference on Networked Systems Design and Implementation},
 year = {2011}
} 

@inproceedings{mesos,
 author = {Hindman, Benjamin and Konwinski, Andy and Zaharia, Matei and Ghodsi, Ali and Joseph, Anthony D. and Katz, Randy and Shenker, Scott and Stoica, Ion},
 title = {Mesos: a Platform for Fine-grained Resource Sharing in the Data Center},
 booktitle = {Proceedings of the 8th USENIX conference on Networked Systems Design and Implementation},
 year = {2011}
} 

@article{condor, 
  author    = "Douglas Thain and Todd Tannenbaum and Miron Livny",
  title     = {{Distributed Computing in Practice: the Condor Experience}},
  journal   = "Concurrency - Practice and Experience",
  volume    = "17",
  number    = "2-4",
  year      = "2005",
  pages     = "323-356",
}


@article{deterlab,
  title={{Cyber Defense Technology Networking and Evaluation}},
  author={Bajcsy, R. and Benzel, T. and Bishop, M. and others},
  journal={Communications of the ACM},
  year={2004},
  publisher={ACM}
}



@article{kernighanlin,
    author = {Kernighan, B. W. and Lin, S.},
    citeulike-article-id = {883684},
    journal = {The {B}ell system technical journal},
    keywords = {spectral},
    number = {1},
    pages = {291--307},
    posted-at = {2006-10-04 14:32:42},
    priority = {2},
    title = {{An Efficient Heuristic Procedure for Partitioning Graphs}},
    volume = {49},
    year = {1970}
}



@article{assign,
 author = {Ricci, R. and Alfeld, C. and Lepreau, J.},
 title = {{A Solver for the Network Testbed Mapping Problem}},
 journal = {SIGCOMM Comput. Commun. Rev.},
 issue_date = {April 2003},
 volume = {33},
 number = {2},
 year = {2003},
 pages = {65--81},
} 

@MISC{emuothers,
    title = {{Other Emulab Testbeds}},
    howpublished = {\url{https://users.emulab.net/trac/emulab/wiki/OtherEmulabs}},
}

@inproceedings{deter,
  title={{Experience with DETER: A Testbed for Security Research}},
  author={Benzel, T. and Braden, R. and Kim, D. and Neuman, C. and Joseph, A. and Sklower, K. and Ostrenga, R. and Schwab, S.},
  booktitle={Testbeds and Research Infrastructures for the Development of Networks and Communities, 2006. TRIDENTCOM 2006. 2nd International Conference on},
  pages={10--pp},
  year={2006},
  organization={IEEE}
}


@article{planetlab,
  title={{Planetlab: an Overlay Testbed for Broad-coverage Services}},
  author={Chun, B. and Culler, D. and others},
  journal={ACM SIGCOMM Computer Communication Review},
  volume={33},
  number={3},
  pages={3--12},
  year={2003},
  publisher={ACM}
}

@inproceedings{sonia1,
  title={{Emulation versus Simulation: A Case Study of TCP-targeted Denial of Service Attacks}},
  author={Chertov, R. and Fahmy, S. and Shroff, N.B.},
  booktitle={Testbeds and Research Infrastructures for the Development of Networks and Communities, 2006. TRIDENTCOM 2006. 2nd International Conference on},
  pages={10--pp},
  year={2006},
  organization={IEEE}
}


@article{sonia2,
  title={{Fidelity of Network Simulation and Emulation: A Case Study of TCP-targeted Denial of Service Attacks}},
  author={Chertov, R. and Fahmy, S. and Shroff, N.B.},
  journal={ACM Transactions on Modeling and Computer Simulation (TOMACS)},
  volume={19},
  number={1},
  pages={1--29},
  year={2008},
  publisher={ACM}
}


@inproceedings{starbed,
  title={{StarBED and SpringOS: large-scale General Purpose Network Testbed and Supporting Software}},
  author={Miyachi, T. and Chinen, K. and Shinoda, Y.},
  booktitle={Proceedings of the 1st international conference on Performance Evaluation Methodolgies and Tools},
  year={2006},
}

@inproceedings{orbit,
  title={{Overview of the ORBIT Radio Grid Testbed for Evaluation of Next-generation Wireless Network Protocols}},
  author={Raychaudhuri, D. and Seskar, I. and Ott, M. and Ganu, S. and Ramachandran, K. and Kremo, H. and Siracusa, R. and Liu, H. and Singh, M.},
  booktitle={Wireless Communications and Networking Conference, 2005 IEEE},
  volume={3},
  pages={1664--1669},
  year={2005}
}

@inproceedings{geni,
  title={{The GENI Meta-Operations Center}},
  author={Herron, J.P. and Fowler, L. and Small, C.},
  booktitle={Proc. of IEEE Conf. on eScience},
  pages={384--385},
  year={2008},
  organization={IEEE Computer Society}
}

@book{kruskal,
  title={Engineering statistics},
  author={Hogg, R.V. and Ledolter, J.},
  year={1987},
  publisher={New York: MacMillan}
}

@article{annealing,
    author = {Kirkpatrick, S. and Gelatt, C. D. and Vecchi, M. P.},
    citeulike-article-id = {1612433},
    citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.4175},
    journal = {Science},
    number={4598},
    volume={220},
    keywords = {metaheuristic, metropolis, optimization, simulated-annealing, stochastic},
    pages = {671--680},
    posted-at = {2007-09-03 09:51:25},
    priority = {0},
    title = {{Optimization by Simulated Annealing}},
    url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.4175},
    year = {1983}
}

@article{migds,
 author = {Milojicic, Dejan S. and Douglis, Fred and Paindaveine, Yves and Wheeler, Richard and Zhou, Songnian},
 title = {{Process migration}},
 journal = {ACM Comput. Surv.},
 issue_date = {Sept. 2000},
 volume = {32},
 number = {3},
 month = sep,
 year = {2000},
 issn = {0360-0300},
 pages = {241--299},
 numpages = {59},
 url = {http://doi.acm.org/10.1145/367701.367728},
 doi = {10.1145/367701.367728},
 acmid = {367728},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {distributed operating systems, distributed systems, load distribution, process migration},
} 


@article{csfq,
 author = {Stoica, I. and Shenker, S. and Zhang, H.},
 title = {{Core-stateless Fair Queueing: a Scalable Architecture to Approximate Fair Bandwidth Allocations in High-speed Networks}},
 journal = {IEEE/ACM Trans. Netw.},
 issue_date = {February 2003},
 volume = {11},
 number = {1},
 year = {2003},
 pages = {33--46},
} 

@inproceedings{fedd,
author={Ted Faber and John Wroclawski}, 
title={{A Federated Experiment Environment for Emulab-based Testbeds}}, 
booktitle={Proceedings of The 5th International Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities},
month={April},
year={ 2009}}

@inproceedings{brite,
 author = {Medina, A. and Lakhina, A. and Matta, I. and others},
 title = {{BRITE: An Approach to Universal Topology Generation}},
 booktitle = {Proc. of MASCOTS},
 year = {2001},
 pages = {346--},
 publisher = {IEEE Computer Society},
 keywords = {topology generation, graph models, network topology, growth models, annotated topologies, simulation environments.},
} 


%%% related work
@article{yu2008rethinking,
  title={{Rethinking Virtual Network Embedding: Substrate Support for Path Splitting and Migration}},
  author={Yu, M. and Yi, Y. and Rexford, J. and Chiang, M.},
  journal={ACM SIGCOMM Comp. Comm. Rev.},
  volume={38},
  number={2},
  pages={17--29},
  year={2008},
}

@inproceedings{chowdhury2009virtual,
  title={Virtual network embedding with coordinated node and link mapping},
  author={Chowdhury, N. M. M. K. and Rahman, M.R. and Boutaba, R.},
  booktitle={Proc. of INFOCOM 2009},
  pages={783--791},
  year={2009}
}

@article{lu2006efficient,
  title={Efficient Mapping of Virtual Networks onto a Shared Substrate},
  author={Lu, J. and Turner, J.},
  journal={Washington University in St. Louis, Tech. Rep},
  year={2006}
}

@inproceedings{kim2011understanding,
  title={{Understanding and Characterizing PlanetLab Resource Usage for Federated Network Testbeds}},
  author={Kim, W. and Roopakalu, A. and Li, K.Y. and Pai, V.S.},
  booktitle={Proc. of the ACM SIGCOMM},
  pages={515--532},
  year={2011},
  organization={ACM}
}

@inproceedings{Hermenier2012how,
  title={{How to Build a Better Testbed: Lessons From a Decade of Network Experiments on Emulab}},
  author={Hermenier, F. and Ricci, R.},
  booktitle={TridentCom},
  year={2012}
}

@inproceedings{OnlineMeasurement,
language = {English},
copyright = {Copyright 2006, The Institution of Engineering and Technology},
title = {A {T}estbed for {A}gent-based {M}ulti-purpose {E}xtensible {A}ctive {M}easurement},
journal = {Proc. of Tridentcom},
author = {Zhanikeev, M. and Tanaka, Y.},
year = {2006},
address = {Piscataway, NJ, USA},
}


@inproceedings{simpleTestBed,
language = {English},
copyright = {Copyright 2005, IEE},
title = {Automatic {C}onfiguration and {E}xecution of {I}nternet {E}xperiments on an {A}ctual {N}ode-based {T}estbed},
booktitle = {Proc.  of Tridentcom},
author = {Miyachi, T. and Chinen, K. and Shinoda, Y.},
year = {2005},
}


@inproceedings{OpenRoads,
language = {English},
copyright = {Compilation and indexing terms, Copyright 2011 Elsevier Inc.},
copyright = {Compendex},
title = {The {S}tanford {O}pen{R}oads {D}eployment},
booktitle = {Proc. of WiNTECH},
author = {Yap, Kok-Kiong and Kobayashi, Masayoshi and Underhill, David and Seetharaman, Srinivasan and Kazemian, Peyman and McKeown, Nick},
year = {2009},
pages = {59 - 66},
}


@inproceedings{StarBED2,
title = {StarBED2: {L}arge-scale, {R}ealistic and {R}eal-time {T}estbed for {U}biquitous {N}etworks},
booktitle = {Proc. of TridentCom},
author = {Nakata, J. and Uda, S. and Miyaclii, T. and others},
year = {2007},
}


@inproceedings{TORI,
language = {English},
copyright = {Compilation and indexing terms, Copyright 2011 Elsevier Inc.},
copyright = {Compendex},
title = {{TORI}: {U}ser {P}rovided {F}uture {N}etworking {T}estbeds},
journal = {Proceedings - 2009 IEEE International Conference on Communications Workshops, ICC 2009},
author = {Stiemerling, M. and Brunner, M. and Kiesel, S. and Fu, X.},
year = {2009},
}


@inproceedings{GlobusPlanetLab,
language = {English},
copyright = {Compilation and indexing terms, Copyright 2011 Elsevier Inc.},
title = {Globus and {P}lanetLab {R}esource {M}anagement {S}olutions {C}ompared},
booktitle = {Proc. of International Symposium on High Performance Distributed Computing},
author = {Ripeanu, M. and Bowman, M. and Chase, S. and others},
year = {2004},
pages = {246 -- 255},
}


@inproceedings{floorControl,
title = {Implementation and {E}mpirical {E}valuations of {F}loor {C}ontrol {P}rotocols on {P}lanetlab {N}etwork},
booktitle = {Proceedings of the 47th Annual Southeast Regional Conference, ACM-SE 47},
author = {Banik, S. M. and Daigle, L. P. and Chang, T. H.},
year = {2009},
}


@article{CoMon,
language = {English},
copyright = {Compilation and indexing terms, Copyright 2011 Elsevier Inc.},
copyright = {Compendex},
title = {Co{M}on: {A} {M}ostly-scalable {M}onitoring {S}ystem for {P}lanet{L}ab},
journal = {Operating Systems Review (ACM)},
author = {Park, KyoungSoo and Pai, Vivek S.},
volume = {40},
number = {1},
year = {2006},
pages = {65 - 74},
issn = {01635980},
}


@inproceedings{Vendetta,
language = {English},
copyright = {Copyright 2008, The Institution of Engineering and Technology},
title = {Vendetta: {A} {T}ool for {F}lexible {M}onitoring and {M}anagement of {D}istributed {T}estbeds},
journal = {2007 3rd International Conference on Testbeds and Research Infrastructues for the Development of Networks and Communities - TridentCom '07},
author = {Rensfelt, O. and Larzon, L.-A. and Westergren, S.},
year = {2007},
pages = {Z13-Z20 - },
address = {Piscataway, NJ, USA},
}


@article{meshnet,
language = {English},
copyright = {Compilation and indexing terms, Copyright 2011 Elsevier Inc.},
copyright = {Compendex},
title = {Experiences {F}rom the {D}esign, {D}eployment, and {U}sage of the {UCSB} {M}eshnet {T}estbed},
journal = {IEEE Wireless Communications},
author = {Lundgren, Henrik and Ramachandran, Krishna and Belding-Royer, Elizabeth and Almeroth, Kevin and Benny, Michael and Hewatt, Andrew and Touma, Alexander and Jardosh, Amit},
volume = {13},
number = {2},
year = {2006},
pages = {18 - 29},
issn = {15361284},
abstract = {In this article we report on our effort and experience in designing, deploying, and using our 30-node wireless mesh testbed, the University of California at Santa Barbara (UCSB) MeshNet. Compared to simulation, the construction and utilization of a wireless mesh testbed poses many new challenges. We discuss the challenges with distributed testbed management, nonintrusive and distributed monitoring, and node status visualization. These are vital components in a sustainable wireless mesh testbed, but at the same time nontrivial to design and realize. As a case study, we present the UCSB MeshNet architecture, including its management, monitoring, and visualization systems. We share our lessons learned from this effort and believe that they will be valuable to other researchers who develop experimental wireless mesh networks. &copy; 2006 IEEE.},
}




%%% topology related

@inproceedings{LEAP,
language = {English},
copyright = {Compilation and indexing terms, Copyright 2011 Elsevier Inc.},
copyright = {Compendex},
title = {Mining {S}ignificant {G}raph {P}atterns by {L}eap {S}earch},
journal = {Proceedings of the ACM SIGMOD International Conference on Management of Data},
author = {Yan, Xifeng and Cheng, Hong and Han, Jiawei and Yu, Philip S.},
year = {2008},
pages = {433 - 444},
issn = {07308078},
address = {Vancouver, BC, Canada},
abstract = {With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. Most objective functions are not antimonotonic, which could fail all of frequency-centric graph mining algorithms. In this paper, we give the first comprehensive study on general mining method aiming to find most significant patterns directly. Our new mining framework, called LEAP (Descending Leap Mine), is developed to exploit the correlation between structural similarity and significance similarity in a way that the most significant pattern could be identified quickly by searching dissimilar graph patterns. Two novel concepts, structural leap search and frequency descending mining, are proposed to support leap search in graph pattern space. Our new mining method revealed that the widely adopted branch-and-bound search in data mining literature is indeed not the best, thus sketching a new picture on scalable graph pattern discovery. Empirical results show that LEAP achieves orders of magnitude speedup in comparison with the state-of-the-art method. Furthermore, graph classifiers built on mined patterns outperform the up-to-date graph kernel method in terms of efficiency and accuracy, demonstrating the high promise of such patterns. Copyright 2008 ACM.},
}


@inproceedings{kNN,
language = {English},
copyright = {Compilation and indexing terms, Copyright 2011 Elsevier Inc.},
copyright = {Compendex},
title = {GraphSig: a {S}calable {A}pproach to {M}ining {S}ignificant {S}ubgraphs in {L}arge {G}raph {D}atabases},
journal = {Proceedings - International Conference on Data Engineering},
author = {Ranu, Sayan and Singh, Ambuj K.},
year = {2009},
pages = {844 - 855},
issn = {10844627},
address = {Shanghai, China},
abstract = {Graphs are being increasingly used to model a wide range of scientific data. Such widespread usage of graphs has generated considerable interest in mining patterns from graph databases. While an array of techniques exists to mine frequent patterns, we still lack a scalable approach to mine statistically significant patterns, specifically patterns with low p-values, that occur at low frequencies. We propose a highly scalable technique, called GraphSig, to mine significant subgraphs from large graph databases. We convert each graph into a set of feature vectors where each vector represents a region within the graph. Domain knowledge is used to select a meaningful feature set. Prior probabilities of features are computed empirically to evaluate statistical significance of patterns in the feature space. Following analysis in the feature space, only a small portion of the exponential search space is accessed for further analysis. This enables the use of existing frequent subgraph mining techniques to mine significant patterns in a scalable manner even when they are infrequent. Extensive experiments are carried out on the proposed techniques, and empirical results demonstrate that GraphSig is effective and efficient for mining significant patterns. To further demonstrate the power of significant patterns, we develop a classifier using patterns mined by GraphSig. Experimental results show that the proposed classifier achieves superior performance, both in terms of quality and computation cost, over state-of-the-art classifiers. &copy; 2009 IEEE.},
}


@inproceedings{SFS,
language = {English},
copyright = {Compilation and indexing terms, Copyright 2011 Elsevier Inc.},
copyright = {Compendex},
title = {Structure {F}eature {S}election for {G}raph {C}lassification},
journal = {International Conference on Information and Knowledge Management, Proceedings},
author = {Fei, Hongliang and Huan, Jun},
year = {2008},
pages = {991 - 999},
address = {Napa Valley, CA, United states},
abstract = {With the development of highly efficient graph data collection technology in many application fields, classification of graph data emerges as an important topic in the data mining and machine learning community. Towards building highly accurate classification models for graph data, here we present an efficient graph feature selection method. In our method, we use frequent subgraphs as features for graph classification. Different from existing methods, we consider the spatial distribution of the subgraph features in the graph data and select those ones that have consistent spatial location. We have applied our feature selection methods to several cheminformatics benchmarks. Our method demonstrates a significant improvement of prediction as compared to the state-of-the-art methods. Copyright 2008 ACM.},
}


@inproceedings{Boost,
language = {English},
copyright = {Copyright 1997, IEE},
title = {Experiments with a {N}ew {B}oosting {A}lgorithm},
journal = {Machine Learning. Proceedings of the Thirteenth International Conference (ICML '96)},
author = {Freund, Y. and Schapire, R.E.},
year = {1996},
pages = {148 - 56},
address = {San Francisco, CA, USA},
abstract = {In an earlier paper, we introduced a new &ldquo;boosting&rdquo; algorithm called AdaBoost which, theoretically, can be used to significantly reduce the error of any learning algorithm that consistently generates classifiers whose performance is a little better than random guessing. We also introduced the related notion of a &ldquo;pseudo-loss&rdquo; which is a method for forcing a learning algorithm of multi-label concepts to concentrate on the labels that are hardest to discriminate. In this paper, we describe experiments we carried out to assess how well AdaBoost with and without pseudo-loss, performs on real learning problems. We performed two sets of experiments. The first set compared boosting to Breiman's &ldquo;bagging&rdquo; method when used to aggregate various classifiers (including decision trees and single attribute-value tests). We compared the performance of the two methods on a collection of machine-learning benchmarks. In the second set of experiments, we studied in more detail the performance of boosting using a nearest-neighbor classifier on an OCR problem},
}


@article{Ullman,
language = {English},
copyright = {Copyright 1976, IEE},
title = {An {A}lgorithm for {S}ubgraph {I}somorphism},
journal = {Journal of the Association for Computing Machinery},
author = {Ullmann, J.R.},
volume = { 23},
number = { 1},
year = {1976/01/},
pages = {31 - 42},
issn = {0004-5411},
address = {USA},
abstract = {Subgraph isomorphism can be determined by means of a brute-force tree-search enumeration procedure. In this paper a new algorithm is introduced that attains efficiency by inferentially eliminating successor nodes in the tree search. To assess the time actually taken by the new algorithm, subgraph isomorphism, clique detection, graph isomorphism, and directed graph isomorphism experiments have been carried out with random and with various nonrandom graphs. A parallel asynchronous logic-in-memory implementation of a vital part of the algorithm is also described, although this hardware has not actually been built. The hardware implementation would allow very rapid determination of isomorphism},
}


@article{VF2,
language = {English},
copyright = {Compilation and indexing terms, Copyright 2011 Elsevier Inc.},
copyright = {Compendex},
title = {A (sub)graph {I}somorphism {A}lgorithm for {M}atching {L}arge {G}raphs},
journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
author = {Cordella, Luigi P. and Foggia, Pasquale and Sansone, Carlo and Vento, Mario},
volume = {26},
number = {10},
year = {2004},
pages = {1367 - 1372},
issn = {01628828},
abstract = {We present an algorithm for graph isomorphism and subgraph isomorphism suited for dealing with large graphs. A first version of the algorithm has been presented in a previous paper, where we examined its performance for the isomorphism of small and medium size graphs. The algorithm is improved here to reduce its spatial complexity and to achieve a better performance on large graphs; its features are analyzed in detail with special reference to time and memory requirements. The results of a testing performed on a publicly available database of synthetically generated graphs and on graphs relative to a real application dealing with technical drawings are presented, confirming the effectiveness of the approach, especially when working with large graphs. &copy; 2004 IEEE.},
}


@inproceedings{BLISS,
language = {English},
copyright = {Compilation and indexing terms, Copyright 2011 Elsevier Inc.},
copyright = {Compendex},
title = {Engineering an {E}fficient {C}anonical {L}abeling {T}ool for {L}arge and {S}parse {G}raphs},
journal = {Proceedings of the 9th Workshop on Algorithm Engineering and Experiments and the 4th Workshop on Analytic Algorithms and Combinatorics},
author = {Junttila, Tommi and Kaski, Petteri},
year = {2007},
pages = {135 - 149},
address = {New Orleans, LA, United states},
abstract = {The problem of canonically labeling a graph is studied. Within the general framework of backtracking algorithms based on individualization and refinement, data structures, subroutines, and pruning heuristics especially for fast handling of large and sparse graphs are developed. Experiments indicate that the algorithm implementation in most cases clearly outperforms existing state-of-the-art tools.},
}

@book{nauty,
  title={{Practical {G}raph {I}somorphism}},
  author={McKay, B.D. and Vanderbilt University. Dept. of Computer Science},
  year={1981},
  publisher={Citeseer}
}

@book{Valiente,
  title={{Algorithms on {T}rees and {G}raphs}},
  author={Valiente, G.},
  isbn={3540435506},
  year={2002},
  publisher={Springer Verlag}
}

@article{conauto,
  title={{Graph Isomorphism Testing Without Full Automorphism Group Computation}},
  author={L{\'o}pez-Presa, J.L. and Fern{\'a}ndez, A.},
  year={2004},
  publisher={Citeseer}
}

@MISC{igraph,
	title = {igraph},
	howpublished = "{http://igraph.sourceforge.net/}",
}

@MISC{BGL,
	title = {{Boost Graph Library}},
	howpublished = "{http://www.boost.org/}",
}

@MISC{JgraphT,
	title = {{JgraphT}},
	howpublished = "{http://www.jgrapht.org/}",
}

@MISC{yWorks,
	title = {{yWorks}},
	howpublished = "{http://www.yworks.com/}",
}

@MISC{LEDA,
	title = {{LEDA}},
	howpublished = "{http://www.algorithmic-solutions.com/}",
}

@MISC{topologies,
    title = {{Network Topologies}},
    howpublished = {http://en.wikipedia.org/wiki/Network\_topology},
}

@MISC{graphiso,
    title = {{Graph Isomorphism Problem}},
    howpublished = {http://en.wikipedia.org/wiki/Graph\_isomorphism\_problem},
}

@MISC{PlanetLabUsage,
    title = {{PlanetLab Usage Statistics}},
    howpublished = {http://everlab.cs.huji.ac.il/plcstats},
}

@MISC{schooner,
    title = {{Schooner WAIL (Wisconsin Advanced Internet Laboratory)}},
    howpublished = {\url{http://www.schooner.wail.wisc.edu}},
}

@MISC{ncr,
    title = {{National Cyber Range, DARPA-BAA-08-43}},
    howpublished = {http://www.darkgovernment.com/news/darpa-national-cyber-range/},
}
